IRREDUCIBLE CONGRUENCES OVER GF(p)
نویسنده
چکیده
with coefficients belonging to the same field. Two irreducible m-ic congruences are said to belong to the same conjugate set if one of them can be transformed into the other by a transformation of G. The number of distinct irreducible congruences in a conjugate set will be referred to as the order of the conjugate set. Since the order of the group G is p(pi — l), it follows that the order of any conjugate set will be at most p(p2 — l). A classification of the irreducible binary modular forms under the group of all binary linear homogeneous transformations of determinant unity in the field GF(pn) has been done by Dickson[4]. Since an irreducible binary modular form over GF(p) of degree m in x and y defines an irreducible m-ic congruence C(z) over GF(p) with roots \^ = (x/yy\ 7=0, 1, 2, • ■ • , m — 1), in the Galois field GF(pm), it follows that Dickson's results provide a classification of the irreducible m-ic congruences over GF(p) under the subgroup G' of transformations of G with determinant a square in GF(p). Clearly, G' is a proper subgroup of G if p>2, and a conjugate set C under the group G will consist of, at most, two conjugate sets Ci, C{ under the smaller group G', i.e., C = C{\JC2. It is shown in §2 that if aiEGF(pm) characterizes the set C{ under G', then — <ri will characterize the set C2 under G' and a\ will characterize the conjugate set C under the group G. In studying the irreducible binary modular forms over GF(pn), Dickson lists two relative invariants, namely,
منابع مشابه
Irreducible Congruences over Gf ( 2 ) 0 )
In characterizing and determining the number of conjugate sets of irreducible congruences of degree m belonging to GF(p) relative to the group G(p) of linear fractional transformations with coefficients belonging to the same field, the case p = 2 has been consistently excluded from considerations. In this paper we consider the special case p = 2 and determine the number of conjugate sets of zzz...
متن کاملConstructing Irreducible Polynomials with Prescribed Level Curves over Finite Fields
We use Eisenstein’s irreducibility criterion to prove that there exists an absolutely irreducible polynomial P(X,Y) ∈ GF(q)[X,Y] with coefficients in the finite field GF(q) with q elements, with prescribed level curves Xc := {(x,y)∈GF(q)2 | P(x,y)= c}. 2000 Mathematics Subject Classification. 11T06.
متن کاملA New Algebraic Method to Search Irreducible Polynomials Using Decimal Equivalents of Polynomials over Galois Field GF(p^q)
Irreducible polynomials play an important role till now, in construction of 8-bit S-Boxes in ciphers. The 8-bit S-Box of Advanced Encryption Standard is a list of decimal equivalents of Multiplicative Inverses (MI) of all the elemental polynomials of a monic irreducible polynomial over Galois Field GF(2) [1]. In this paper a new method to search monic Irreducible Polynomials (IPs) over Galois f...
متن کامل4, 8, 32, 64 bit Substitution Box generation using Irreducible or Reducible Polynomials over Galois Field GF(p^q) for Smart Applications
Substitution Box or S-Box had been generated using 4-bit Boolean Functions (BFs) for Encryption and Decryption Algorithm of Lucifer and Data Encryption Standard (DES) in late sixties and late seventies respectively. The SBox of Advance Encryption Standard have also been generated using Irreducible Polynomials over Galois field GF(2 8 ) adding an additive constant in early twenty first century. ...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کامل